ct 2 01 4 Bases of the Galois Ring GR ( p r , m ) over the Integer Ring
نویسنده
چکیده
The Galois ring GR(p,m) of characteristic p and cardinality p, where p is a prime and r,m ≥ 1 are integers, is a Galois extension of the residue class ring Zpr by a root ω of a monic basic irreducible polynomial of degree m over Zpr . Every element of GR(p ,m) can be expressed uniquely as a polynomial in ω with coefficients in Zpr and degree less than or equal to m − 1, thus GR(p,m) is a free module of rank m over Zpr with basis {1, ω, ω, . . . , ω}. The ring Zpr satisfies the invariant dimension property, hence any other basis of GR(p,m), if it exists, will have cardinality m. This paper was motivated by the code-theoretic problem of finding the homogeneous bound on the p-image of a linear block code over GR(p,m) with respect to any basis. It would be interesting to consider the dual and normal bases of GR(p,m). By using a Vandermonde matrix over GR(p,m) in terms of the generalized Frobenius automorphism, a constructive proof that every basis of GR(p,m) has a unique dual basis is given. The notion of normal bases was also generalized from the classic case for Galois fields.
منابع مشابه
Bases of the Galois Ring $GR(p^r, m)$ over the Integer Ring $Z_{p^r}$
The Galois ring GR(p,m) of characteristic p and cardinality p, where p is a prime and r,m ≥ 1 are integers, is a Galois extension of the residue class ring Zpr by a root ω of a monic basic irreducible polynomial of degree m over Zpr . Every element of GR(p ,m) can be expressed uniquely as a polynomial in ω with coefficients in Zpr and degree less than or equal to m − 1, thus GR(p,m) is a free m...
متن کاملA Gilbert-Varshamov type bound for linear codes over Galois rings
In this paper we derive a Gilbert-Varshamov type bound for linear codes over Galois rings. For linear codes over the Galois ring GR(pl; j) the result can be stated as follows. Given r; such that 0 < r < 1 and 0 < H 1 pj (1 r): Then for all n N; where N is a sufficiently large integer, there exist [n; k] GR linear codes over GR(pl; j) such that k=n r and d=n : Consequently, this bound does not g...
متن کاملPolycyclic codes over Galois rings with applications to repeated-root constacyclic codes
Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p,m) and generating sets for its ideals are considered. It is shown that these generating sets are strong Groebner bases. A method for finding ...
متن کاملLeft dihedral codes over Galois rings ${\rm GR}(p^2,m)$
Let D2n = 〈x, y | x = 1, y = 1, yxy = x〉 be a dihedral group, and R = GR(p, m) be a Galois ring of characteristic p and cardinality p where p is a prime. Left ideals of the group ring R[D2n] are called left dihedral codes over R of length 2n, and abbreviated as left D2n-codes over R. Let gcd(n, p) = 1 in this paper. Then any left D2n-code over R is uniquely decomposed into a direct sum of conca...
متن کاملBounds on the Minimum Homogeneous Distance of the pr-ary Image of Linear Block Codes Over the Galois Ring GR(pr, m)
In this paper, bounds are derived on the minimum homogeneous distance of the image of a linear block code over the Galois ring GR(p, m), with respect to any basis of GR(p, m). These bounds depend on the parameters of GR(p, m), the minimum Hamming distance of the block code, and the average value of the homogeneous weight applied on the base ring Zpr . Examples are given of Galois ring codes tha...
متن کامل